C4: verified transactional objects

Transactional objects combine the performance of classical concurrent with high-level programmability transactional memory. However, verifying correctness is tricky, requiring reasoning simultaneously about objects, which guarantee atomicity individual methods—the property known as linearizability—and software-transactional-memory libraries, user-defined sequences method calls—or serializability. We present a formal-verification framework called C4, built up from familiar notion linearizability and its compositional properties, that allows proof both kinds along composition theorems styles to prove applications or further libraries. apply in significant case study, set object out components following technique predication ; modular, separately nontransactional parts implementation. Central our approach use syntactic transformers on interaction trees —i.e., libraries transform client code enforce particular synchronization disciplines. Our studies are mechanized Coq.